Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
minus(0) |
→ 0 |
| 2: |
|
x + 0 |
→ x |
| 3: |
|
0 + y |
→ y |
| 4: |
|
minus(1) + 1 |
→ 0 |
| 5: |
|
minus(minus(x)) |
→ x |
| 6: |
|
x + minus(y) |
→ minus(minus(x) + y) |
| 7: |
|
x + (y + z) |
→ (x + y) + z |
| 8: |
|
minus(x + 1) + 1 |
→ minus(x) |
|
There are 6 dependency pairs:
|
| 9: |
|
x +# minus(y) |
→ MINUS(minus(x) + y) |
| 10: |
|
x +# minus(y) |
→ minus(x) +# y |
| 11: |
|
x +# minus(y) |
→ MINUS(x) |
| 12: |
|
x +# (y + z) |
→ (x + y) +# z |
| 13: |
|
x +# (y + z) |
→ x +# y |
| 14: |
|
minus(x + 1) +# 1 |
→ MINUS(x) |
|
The approximated dependency graph contains one SCC:
{10,12,13}.
-
Consider the SCC {10,12,13}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 3, 2006